embedding algorithmの例文
- For more general graphs, some greedy embedding algorithms such as the one by Kleinberg start by finding a spanning tree of the given graph, and then construct a greedy embedding of the spanning tree.
- His research interests include algorithms for graphs, the development of mathematical software, the graph reconstruction problem, the graph isomorphism problem, projective geometry, Hamiltonian cycles, planarity, graph embedding algorithms, graphs on surfaces, and combinatorial designs.
